Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels
نویسندگان
چکیده
منابع مشابه
Optimal detection of discrete Markov sources over discrete memoryless channels - applications to combined source-channel coding
sides of the preceding inequality by c([o(N-1) + N] log, N)-' finishes the proof. 0 ACKNOWLEDGMENT
متن کاملDistributed Hypothesis Testing Over Orthogonal Discrete Memoryless Channels
A distributed binary hypothesis testing problem is studied in which multiple helpers transmit their observations to a remote detector over orthogonal discrete memoryless channels. The detector uses the received samples from the helpers along with its own observations to test for the joint distribution of the data. Single-letter inner and outer bounds for the type 2 error exponent (T2EE) is esta...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملTransmission of Non-Uniform Memoryless Sources over Wireless Fading Channels via Non-Systematic Turbo Codes1
In this work, we investigate the joint source-channel coding problem of transmitting non-uniform memoryless sources over wireless Rayleigh fading channels via Turbo codes. The source redundancy in the form of non-uniformity is exploited in the Turbo decoder by incorporating the source statistics in the modified extrinsic information. In contrast to previous work, non-systematic recursive convol...
متن کاملQuantization of memoryless and Gauss-Markov sources over binary Markov channels
Joint source–channel coding for stationary memoryless and Gauss–Markov sources and binary Markov channels is considered. The channel is an additive-noise channel where the noise process is an M th-order Markov chain. Two joint source-channel coding schemes are considered. The first is a channel-optimized vector quantizer—optimized for both source and channel. The second scheme consists of a sca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2930252